package QuestionDaily;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class minReorder_1466 {
    private List<Integer>[] g;
    private int[] price, cnt;
    private int end;
    public int minReorder(int n, int[][] connections) {
        /**
         * 暂时思路是递归考虑所有情况
         * 想不出来，暴力明显会超时
         */
        g = new ArrayList[n];  //g[i] 是 第 i 个节点的相邻节点
        Arrays.setAll(g, e -> new ArrayList<>()); //初始化数组
        for (int[] e : connections) {
            int x = e[0], y = e[1];  //记录每个节的点相邻节点
            g[x].add(y);
            g[y].add(x);
        }
        return 0;
    }
}
